从智能制造收集的数据的不断增长的可用性正在改变生产监测和控制的范式。除了时变的意外的扰动和不确定性之外，晶片制造过程的复杂性和内容的增加，使得用基于模型的方法进行控制过程，使控制过程不可行。结果，数据驱动的软感测建模在晶圆过程诊断中变得更加普遍。最近，在高度非线性和动态时间序列数据中具有高度性能的软感测系统中已经利用了深度学习。然而，尽管它在软感动系统中取得了成功，但深层学习框架的潜在逻辑很难理解。在本文中，我们提出了一种使用高度不平衡数据集的缺陷晶片检测的深度学习模型。要了解所提出的模型如何工作，应用了深度可视化方法。另外，该模型然后通过深度可视化指导进行微调。进行广泛的实验以验证所提出的系统的有效性。结果提供了一种解释模型工作原理和基于解释的有效微调方法的解释。

在过去的几十年中，现代工业过程研究了几种具有成本效益的方法，以提高半导体制造的生产率和产量。虽然在促进实时监控和控制方面发挥重要作用，但行业中的数据驱动的软传感器在增强了晶圆故障诊断的深度学习方法时提供了竞争优势。尽管各个领域的深度学习方法取得了成功，但它们倾向于在多变化的软感测数据域上遭受不良性能。为了缓解这一点，我们提出了一种用于晶圆故障诊断分类任务的软感应集合器（卷积式变压器），主要由多头卷积模块组成，可获得快速和轻量级操作的卷曲的益处，以及能力通过多头设计相同的变压器来学习强大的表示。另一个关键问题是传统的学习范式倾向于在嘈杂和高度不平衡的软感测数据上遭受低性能。为了解决这个问题，我们使用基于课程的课程的损失函数增强了我们的软感测符合子模型，这有效地在培训的早期阶段和困难的阶段中学习易于样本。为了进一步展示我们拟议的架构的效用，我们对希捷技术的晶圆制造过程的各种工具进行了广泛的实验，这些工具与这项工作一起分享。据我们所知，这是第一次提出了课程，为软感测数据提出了基于课程的软感测符合子架构，我们的结果表明未来在软传感研究领域的使用中有很强的承诺。

在大数据的时代，基于数据驱动的分类已成为智能制造业的基本方法，以指导生产和优化检查。实践中获得的工业数据通常是由软传感器收集的时间序列数据，这是高度非线性，非间断，不平衡和嘈杂的。大多数现有的软传感机器学习模型侧重于捕获串联内部时间依赖关系或预定义的序列间相关性，同时忽略标签之间的相关性，每个实例同时与多个标签相关联。在本文中，我们提出了一种基于曲线的新颖的曲线图，用于多变量时间序列分类噪声和高度不平衡的软感测数据。所提出的基层能够在光谱域中捕获串联串联和串联系列依赖项; 2）通过叠加由统计共生信息构建的标签图来利用标签相关性; 3）从文本和数值域中使用注意机制学习功能; 4）利用未标记的数据并通过半监督学习缓解数据不平衡。与其他常用分类器的比较研究在希捷软感测数据上进行，实验结果验证了我们提出的方法的竞争性能。

随着近年来AI技术的快速发展，柔软传感区域的深层学习模型有很多研究。然而，该模型已经变得更加复杂，但数据集保持有限：研究人员用数百个数据样本拟合百万参数模型，这不足以行使其模型的有效性，因此在工业中实施时通常无法执行应用程序。为解决这一持久的问题，我们正在为公众提供大规模的高维时间序列制造传感器数据。我们展示了这些数据集上软感应变压器模型建模工业大数据的挑战和有效性。使用变压器，因为，它在自然语言处理中表现出优于最先进的技术，从直接应用到计算机视觉时也表现良好，而不引入图像特定的感应偏差。我们观察句子结构与传感器读数的相似性，并以自然语言中的句子类似的方式处理多变量传感器读数。高维时间序列数据被格式化成相同的嵌入式句子，并馈入变压器模型。结果表明，基于自动编码器和长短期存储器（LSTM）模型，变压器模型优于软感测场中的基准模型。据我们所知，我们是学术界或工业的第一支球队，以利用大规模数值软感测数据基准原始变压器模型的性能。

Due to their ability to offer more comprehensive information than data from a single view, multi-view (multi-source, multi-modal, multi-perspective, etc.) data are being used more frequently in remote sensing tasks. However, as the number of views grows, the issue of data quality becomes more apparent, limiting the potential benefits of multi-view data. Although recent deep neural network (DNN) based models can learn the weight of data adaptively, a lack of research on explicitly quantifying the data quality of each view when fusing them renders these models inexplicable, performing unsatisfactorily and inflexible in downstream remote sensing tasks. To fill this gap, in this paper, evidential deep learning is introduced to the task of aerial-ground dual-view remote sensing scene classification to model the credibility of each view. Specifically, the theory of evidence is used to calculate an uncertainty value which describes the decision-making risk of each view. Based on this uncertainty, a novel decision-level fusion strategy is proposed to ensure that the view with lower risk obtains more weight, making the classification more credible. On two well-known, publicly available datasets of aerial-ground dual-view remote sensing images, the proposed approach achieves state-of-the-art results, demonstrating its effectiveness. The code and datasets of this article are available at the following address: https://github.com/gaopiaoliang/Evidential.

Video-language pre-training has advanced the performance of various downstream video-language tasks. However, most previous methods directly inherit or adapt typical image-language pre-training paradigms to video-language pre-training, thus not fully exploiting the unique characteristic of video, i.e., temporal. In this paper, we propose a Hierarchical Temporal-Aware video-language pre-training framework, HiTeA, with two novel pre-training tasks for modeling cross-modal alignment between moments and texts as well as the temporal relations of video-text pairs. Specifically, we propose a cross-modal moment exploration task to explore moments in videos, which results in detailed video moment representation. Besides, the inherent temporal relations are captured by aligning video-text pairs as a whole in different time resolutions with multi-modal temporal relation exploration task. Furthermore, we introduce the shuffling test to evaluate the temporal reliance of datasets and video-language pre-training models. We achieve state-of-the-art results on 15 well-established video-language understanding and generation tasks, especially on temporal-oriented datasets (e.g., SSv2-Template and SSv2-Label) with 8.6% and 11.1% improvement respectively. HiTeA also demonstrates strong generalization ability when directly transferred to downstream tasks in a zero-shot manner. Models and demo will be available on ModelScope.

Face manipulation detection has been receiving a lot of attention for the reliability and security of the face images. Recent studies focus on using auxiliary information or prior knowledge to capture robust manipulation traces, which are shown to be promising. As one of the important face features, the face depth map, which has shown to be effective in other areas such as the face recognition or face detection, is unfortunately paid little attention to in literature for detecting the manipulated face images. In this paper, we explore the possibility of incorporating the face depth map as auxiliary information to tackle the problem of face manipulation detection in real world applications. To this end, we first propose a Face Depth Map Transformer (FDMT) to estimate the face depth map patch by patch from a RGB face image, which is able to capture the local depth anomaly created due to manipulation. The estimated face depth map is then considered as auxiliary information to be integrated with the backbone features using a Multi-head Depth Attention (MDA) mechanism that is newly designed. Various experiments demonstrate the advantage of our proposed method for face manipulation detection.

Implicit regularization is an important way to interpret neural networks. Recent theory starts to explain implicit regularization with the model of deep matrix factorization (DMF) and analyze the trajectory of discrete gradient dynamics in the optimization process. These discrete gradient dynamics are relatively small but not infinitesimal, thus fitting well with the practical implementation of neural networks. Currently, discrete gradient dynamics analysis has been successfully applied to shallow networks but encounters the difficulty of complex computation for deep networks. In this work, we introduce another discrete gradient dynamics approach to explain implicit regularization, i.e. landscape analysis. It mainly focuses on gradient regions, such as saddle points and local minima. We theoretically establish the connection between saddle point escaping (SPE) stages and the matrix rank in DMF. We prove that, for a rank-R matrix reconstruction, DMF will converge to a second-order critical point after R stages of SPE. This conclusion is further experimentally verified on a low-rank matrix reconstruction problem. This work provides a new theory to analyze implicit regularization in deep learning.

Future work sentences (FWS) are the particular sentences in academic papers that contain the author's description of their proposed follow-up research direction. This paper presents methods to automatically extract FWS from academic papers and classify them according to the different future directions embodied in the paper's content. FWS recognition methods will enable subsequent researchers to locate future work sentences more accurately and quickly and reduce the time and cost of acquiring the corpus. The current work on automatic identification of future work sentences is relatively small, and the existing research cannot accurately identify FWS from academic papers, and thus cannot conduct data mining on a large scale. Furthermore, there are many aspects to the content of future work, and the subdivision of the content is conducive to the analysis of specific development directions. In this paper, Nature Language Processing (NLP) is used as a case study, and FWS are extracted from academic papers and classified into different types. We manually build an annotated corpus with six different types of FWS. Then, automatic recognition and classification of FWS are implemented using machine learning models, and the performance of these models is compared based on the evaluation metrics. The results show that the Bernoulli Bayesian model has the best performance in the automatic recognition task, with the Macro F1 reaching 90.73%, and the SCIBERT model has the best performance in the automatic classification task, with the weighted average F1 reaching 72.63%. Finally, we extract keywords from FWS and gain a deep understanding of the key content described in FWS, and we also demonstrate that content determination in FWS will be reflected in the subsequent research work by measuring the similarity between future work sentences and the abstracts.

We propose, Monte Carlo Nonlocal physics-informed neural networks (MC-Nonlocal-PINNs), which is a generalization of MC-fPINNs in \cite{guo2022monte}, for solving general nonlocal models such as integral equations and nonlocal PDEs. Similar as in MC-fPINNs, our MC-Nonlocal-PINNs handle the nonlocal operators in a Monte Carlo way, resulting in a very stable approach for high dimensional problems. We present a variety of test problems, including high dimensional Volterra type integral equations, hypersingular integral equations and nonlocal PDEs, to demonstrate the effectiveness of our approach.